Optimal Grouping of Line Segments into Convex Sets
نویسندگان
چکیده
In this paper, we present a technique for grouping line segments into convex sets, where the line segments are obtained by linking edges obtained from the Canny edge detector. The novelty of the approach is twofold: first we define an efficient approach for testing the global convexity criterion, and second, we develop an optimal search based on dynamic programming for grouping the line segments into convex sets. We show results on real images, and present a specific domain where this type of grouping can be directly applied.
منابع مشابه
Tracking of Convex Objects
In this paper, we present a technique for grouping line segments sinto convex sets, where the line segments are obtained by linking edges obtained from the Canny edge detector. The novelty of the approach is twofold: rst we de ne an e cient approach for testing the global convexity criterion, and second, we develop an optimal search based on dynamic programming or grouping the line segments int...
متن کاملRobust and E cient Detection of Convex Groups 1
This paper describes an algorithm that robustly locates convex collections of line segments in an image. The algorithm is guaranteed to nd all convex sets of line segments in which the length of the line segments accounts for at least some xed proportion of the length of their convex hull. This enables the algorithm to nd convex groups whose contours are partially occluded or missing due to noi...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملConvexity and Geodesic Metric Spaces
In this paper, we first present a preliminary study on metric segments and geodesics in metric spaces. Then we recall the concept of d-convexity of sets and functions in the sense of Menger and study some properties of d-convex sets and d-convex functions as well as extreme points and faces of d-convex sets in normed spaces. Finally we study the continuity of d-convex functions in geodesic metr...
متن کاملLow-level Grouping of Straight Line Segments
In this paper we present a formalism for the formation of self consistent, hierarchical, "Low-Level" groupings of pairs of straight line segments from which all higher level groupings may be derived. Additionally, each low-level grouping is associated with a "Quality" factor, based on evidential reasoning, which reflects how much the groupings differ from mathematically perfect ones. This forma...
متن کامل